Iterative reflections of monads
نویسندگان
چکیده
Iterative monads, introduced by Calvin Elgot in the 1970’s, are those ideal monads in which every guarded system of recursive equations has a unique solution. For every ideal monad M we prove that an iterative reflection, i.e., an embedding M ↪−→ M̂ into an iterative monad with the expected universal property, exists. We also introduce the concept of iterativity for algebras for the monad M, following the footsteps of Evelyn Nelson and Jerzy Tiuryn, and we prove that M is iterative if and only if all free algebras for M are iterative algebras. In mathematics you don’t understand things. You just get used to them. John von Neumann (1903–1957)
منابع مشابه
A Description of Iterative Reflections of Monads
For ideal monads in Set (e. g. the finite list monad, the finite bag monad etc.) we have recently proved that every set generates a free iterative algebra. This gives rise to a new monad. We prove now that this monad is iterative in the sense of Calvin Elgot, in fact, this is the iterative reflection of the given ideal monad. This shows how to freely add unique solutions of recursive equations ...
متن کاملUnifying Guarded and Unguarded Iteration
Models of iterated computation, such as (completely) iterative monads, often depend on a notion of guardedness, which guarantees unique solvability of recursive equations and requires roughly that recursive calls happen only under certain guarding operations. On the other hand, many models of iteration do admit unguarded iteration. Solutions are then no longer unique, and in general not even de...
متن کاملGuarded and Unguarded Iteration for Generalized Processes
Models of iterated computation, such as (completely) iterative monads, often depend on a notion of guardedness, which guarantees unique solvability of recursive equations and requires roughly that recursive calls happen only under certain guarding operations. On the other hand, many models of iteration do admit unguarded iteration. Solutions are then no longer unique, and in general not even de...
متن کاملOn Iteratable Endofunctors
Completely iterative monads of Elgot et al. are the monads such that every guarded iterative equation has a unique solution. Free completely iterative monads are known to exist on every iteratable endofunctor H, i. e., one with final coalgebras of all functors H( ) + X. We show that conversely, if H generates a free completely iterative monad, then it is iteratable.
متن کاملOn second-order iterative monads
B. Courcelle studied algebraic trees as precisely the solutions of all recursive program schemes for a given signature in Set. He proved that the corresponding monad is iterative. We generalize this to recursive program schemes over a given finitary endofunctor H of a ”suitable” category. A monad is called second-order iterative if every guarded recursive program scheme (w.r.t. H) has a unique ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Mathematical Structures in Computer Science
دوره 20 شماره
صفحات -
تاریخ انتشار 2010